Perfect simulation from the Quicksort limit distribution
نویسندگان
چکیده
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect random variate generation from this distribution.
منابع مشابه
Application of perfect mixing model for simulation of vertical roller mills
Vertical roller mills (VRMs) are well-established grinding equipment for various tasks in the coal and cement industry. There are few studies on simulation of VRMs. In this research work, application of perfect mixing model for simulation of a VRM in a cement grinding plant was investigated. Two sampling surveys were carried out on the VRM circuit. The samples and data from the first survey wer...
متن کاملExact and approximate limit behaviour of the Yule tree's cophenetic index
In this work we study the limit distribution of an appropriately normalized cophenetic index of the pure–birth tree conditioned on n contemporary tips. We show that this normalized phylogenetic balance index is a submartingale that converges almost surely and in L2. We link our work with studies on trees without branch lengths and show that in this case the limit distribution is a contraction–t...
متن کاملA local limit theorem for QuickSort key comparisons via multi-round smoothing
It is a well-known result, due independently to Régnier [8] and Rösler [10], that the number of key comparisons required by the randomized sorting algorithm QuickSort to sort a list of n distinct items (keys) satisfies a global distributional limit theorem. We resolve an open problem of Fill and Janson from 2002 by using a multi-round smoothing technique to establish the corresponding local lim...
متن کاملExact L-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract)
Using a recursive approach, we obtain a simple exact expression for the L-distance from the limit in the classical limit theorem of Régnier (1989) for the number of key comparisons required by QuickSort. A previous study by Fill and Janson (2002) using a similar approach found that the d2-distance is of order between n−1 logn and n−1/2, and another by Neininger and Ruschendorf (2002) found that...
متن کاملExact L^2-distance from the limit for QuickSort key comparisons (extended abstract)
Using a recursive approach, we obtain a simple exact expression for the L-distance from the limit in Régnier’s [5] classical limit theorem for the number of key comparisons required by QuickSort. A previous study by Fill and Janson [1] using a similar approach found that the d2-distance is of order between n −1 log n and n, and another by Neininger and Ruschendorf [4] found that the Zolotarev ζ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره math.PR/0005237 شماره
صفحات -
تاریخ انتشار 2000